Distributed $(\Delta+1)$-Coloring in Sublogarithmic Rounds
نویسندگان
چکیده
The (∆+1)-coloring problem is a fundamental symmetry breaking problem in distributed computing. We give a new randomized coloring algorithm for (∆ + 1)-coloring running in O( √ log ∆) + 2O( √ log logn) rounds with probability 1 − 1/nΩ(1) in a graph with n nodes and maximum degree ∆. This implies that the (∆ + 1)-coloring problem is easier than the maximal independent set problem and the maximal matching problem, due to their lower bounds by Kuhn, Moscibroda, and Wattenhofer [PODC’04]. Our algorithm also extends to the list-coloring problem where the palette of each node contains ∆ + 1 colors.
منابع مشابه
Distributed Graph Coloring: Fundamentals and Recent Developments
The focus of this monograph is on symmetry breaking problems in the message-passing model of distributed computing. In this model a communication network is represented by a n-vertex graph G = (V,E), whose vertices host autonomous processors. The processors communicate over the edges of G in discrete rounds. The goal is to devise algorithms that use as few rounds as possible. A typical symmetry...
متن کاملImproved Distributed $\Delta$-Coloring
We present a randomized distributed algorithm that computes a ∆-coloring in any noncomplete graph with maximum degree ∆ ≥ 4 in O(log∆) + 2 √ log logn) rounds, as well as a randomized algorithm that computes a ∆-coloring in O((log logn)) rounds when ∆ ∈ [3, O(1)]. Both these algorithms improve on an O(log n/ log∆)-round algorithm of Panconesi and Srinivasan [STOC’1993], which has remained the st...
متن کاملDistributed coloring algorithms for triangle-free graphs
Vertex coloring is a central concept in graph theory and an important symmetry-breaking primitive in distributed computing. Whereas degree-∆ graphs may require palettes of ∆+1 colors in the worst case, it is well known that the chromatic number of many natural graph classes can be much smaller. In this paper we give new distributed algorithms to find (∆/k)-coloring in graphs of girth 4 (triangl...
متن کاملFast Distributed Coloring Algorithms for Triangle-Free Graphs
Vertex coloring is a central concept in graph theory and an important symmetry-breaking primitive in distributed computing. Whereas degree-∆ graphs may require palettes of∆+1 colors in the worst case, it is well known that the chromatic number of many natural graph classes can be much smaller. In this paper we give new distributed algorithms to find (∆/k)-coloring in graphs of girth 4 (triangle...
متن کاملOn Greedy Graph Coloring in the Distributed Model
In the paper we consider distributed algorithms for greedy graph coloring. For the largest-first (LF) approach, we propose a new distributed algorithm which is shown to color a graph in an expected time of O(∆ log n log∆) rounds, and we prove that any distributed LF-coloring algorithm requires at least Ω(∆) rounds. We discuss the quality of obtained colorings in the general case and for particu...
متن کامل